Concurrent Re Blockinective Computations in Rewriting Logic
نویسندگان
چکیده
Rewriting logic can represent dynamic behaviors of concurrent and/or reactive systems declaratively. Declarative descriptions in rewriting logic are expected to be amenable to analysis of interesting properties. The group-wide architecture based on the actor model is a speci c concurrent re ective computation model based on \group-wide re ection". It has a potential of modeling cooperative behaviors of several software modules (or agents). This paper provides some basic considerations on methods of modeling the group-wide architecture in rewriting logic.
منابع مشابه
An Example for Concurrent Re ective Computations in Rewriting Logic
Rewriting logic can represent dynamic behaviors of concurrent and/or reactive systems declaratively. Declarative descriptions in rewriting logic are expected to be amenable to analysis of interesting properties. The group-wide architecture based on the actor model is a speci c concurrent re ective computation model based on "group-wide re ection". It has a potential of modeling cooperative beha...
متن کاملSemantics of Concurrent Logic Programming as Uniform Proofs
We describe LC , a formalism based on the proof theory of linear logic, whose aim is to specify concurrent computations and whose language restriction (as compared to other linear logic language) provides a simpler operational model that can lead to a more practical language core. The LC fragment is proveded to be an abstract logic programming language, that is any sequent can be derived by uni...
متن کاملHybrid Group Re Blockinective Architecture for Object-oriented Concurrent Re Blockinective Programming
The bene ts of computational re ection are the abilities to reason and alter the dynamic behavior of computation from within the language framework. This is more bene cial in concurrent/distributed computing, where the complexity of the system is much greater compared to sequential computing; we have demonstrated various benets in our past research of Object-Oriented Concurrent Re ective (OOCR)...
متن کاملConcurrent Logic Programming as Uniform Linear Proofs
We describe a formalism based on the proof theory of linear logic, whose aim is to specify concurrent computations and whose language restriction (as compared to other linear logic languages) provides a simpler operational model that can lead to a more practical language core. The fragment is proved to be an abstract logic programming language, that is any sequent can be derived by uniform proo...
متن کاملRewriting Logic and Secure Mobility Why Rewriting Logic
The purpose of this note is to propose a new approach to the formal semantics and declarative programming of mobile applications that meets the needs of mobile computing in a particularly natural and simple way. This approach also ooers a good formal basis for deen-ing the new security models that mobile computing so clearly needs, and formal methods for verifying that declarative mobile progra...
متن کامل